Adaptive Development of Connectionist Decoders for Complex Error-Correcting Codes
نویسندگان
چکیده
\Ve present. an approach for df'velopment of a decoder for any complex binary error-correct.ing code(ECC) via training from examples of decoded received words. Our decoder is a connectionist architecture. We describe two sepa.rate solutions: A system-level solution (the Cascaded Networks Decoder); and the ECC-Enhanced Decoder, a solution which simplifies the mapping problem which must be solved for decoding. Although both solutions meet our basic approach constraint for simplicity and compactness. only the ECC-Enhanced Decoder meet.s our second basic constraint of being a generic solution.
منابع مشابه
Review on Various Turbo Decoders in Networks
This survey paper presents various decoders for wireless sensor networks. Also reviewed many algorithms used for decoding purposes. Turbo codes have been recognized as a milestone in the channel coding theory. These are a class of error correcting codes that come closer to Shannon’s limit than any other class of error correcting codes. Due to their outstanding error-correcting capabilities, tur...
متن کاملDecoding error-correcting codes via linear programming
Error-correcting codes are fundamental tools used to transmit digital information over unreliable channels. Their study goes back to the work of Hamming [Ham50] and Shannon [Sha48], who used them as the basis for the field of information theory. The problem of decoding the original information up to the full error-correcting potential of the system is often very complex, especially for modern c...
متن کاملDecoding Error-Correcting Codes via Linear Programming by
Error-correcting codes are fundamental tools used to transmit digital information over unreliable channels. Their study goes back to the work of Hamming [Ham50] and Shannon [Sha48], who used them as the basis for the field of information theory. The problem of decoding the original information up to the full error-correcting potential of the system is often very complex, especially for modern c...
متن کاملLinear-Time Encodable Error-Correcting Codes Decodable
We present a new class of asymptotically good, linear error-correcting codes. These codes can be both encoded and decoded in linear time. They can also be encoded by logarithmicdepth circuits of l inear size and decoded by logarithmic depth circuits of size O(n log n). W e present both randomized and explicit constructions of these codes. a generator matrix. The second complexity is the time it...
متن کاملA recursive approach to low complexity codes
A bstruciA method is described for constructing long error-correcting codes from one or more shorter error-correcting codes, referred to as subcodes, and a bipartite graph. A graph is shown which specifies carefully chosen subsets of the digits of the new codes that must be codewords in one of the shorter subcodes. Lower bounds to the rate and the minimum distance of the new code are derived in...
متن کامل